Semantic Segmentation and Model Fitting for Triangulated Surfaces using Random Jumps and Graph Cuts
نویسندگان
چکیده
Recent advances in 3D reconstruction allows to acquire highly detailed geometry from a set of images. The outcome of vision-based reconstruction methods is often oversampled, noisy, and without any higher-level information. Further processing such as object recognition, physical measurement, urban modeling, or rendering requires more advanced representations such as computer-aided design (CAD) models. In this paper, we present a global approach that simultaneously decomposes a triangulated surface into meaningful segments and fits a set of bounded geometric primitives. Using the theory of Markov chain Monte Carlo methods (MCMC), a random process is derived to find the solution that most likely explains the measured data. A data-driven approach based on the random sample consensus (RANSAC) paradigm is designed to guide the optimization process with respect to efficiency and robustness. It is shown, that graph cuts allow to incorporate model complexity and spatial regularization into the MCMC process. The algorithm has successfully been implemented and tested on various examples.
منابع مشابه
Graph cut based Automatic Prostate Segmentation
We propose a graph cut based automatic method for prostate segmentation using image features, context information and semantic knowledge. A volume of interest (VOI) is first identified using supervoxel oversegmentation and their subsequent classification. All voxels within the VOI are labeled prostate or background using graph cuts. Semantic information obtained from Random forest (RF) classifi...
متن کاملBrain segmentation and the generation of cortical surfaces.
This paper describes methods for white matter segmentation in brain images and the generation of cortical surfaces from the segmentations. We have developed a system that allows a user to start with a brain volume, obtained by modalities such as MRI or cryosection, and constructs a complete digital representation of the cortical surface. The methodology consists of three basic components: local...
متن کاملA comparative performance of gray level image thresholding using normalized graph cut based standard S membership function
In this research paper, we use a normalized graph cut measure as a thresholding principle to separate an object from the background based on the standard S membership function. The implementation of the proposed algorithm known as fuzzy normalized graph cut method. This proposed algorithm compared with the fuzzy entropy method [25], Kittler [11], Rosin [21], Sauvola [23] and Wolf [33] method. M...
متن کاملInteractive Liver Tumor Segmentation Using Graph-cuts and Watershed
We present in this paper an application of minimal surfaces and Markov random fields to the segmentation of liver tumors. The originality of the work consists in applying these models to the region adjacency graph of a watershed transform. We detail the assumptions and the approximations introduced in these models by using a region graph instead of a pixel graph. This strategy leads to an inter...
متن کاملA Pylon Model for Semantic Segmentation
Graph cut optimization is one of the standard workhorses of image segmentation since for binary random field representations of the image, it gives globally optimal results and there are efficient polynomial time implementations. Often, the random field is applied over a flat partitioning of the image into non-intersecting elements, such as pixels or super-pixels. In the paper we show that if, ...
متن کامل